1 LOCK - FREE TRANSACTIONS FORREAL - TIME SYSTEMSJames
نویسندگان
چکیده
منابع مشابه
cient Object Sharing in Real - Time SystemsJames
We show that, by rejecting a number of conventional assumptions about real-time object sharing, it is possible to develop and implement eecient object-sharing mechanisms on uniprocessors that do not require complex kernel and hardware support. Chief among the assumptions we reject is that objects should be implemented using lock-based protocols. As explained herein, the use of locking in real-t...
متن کاملLock-free Transactions for Real-time Systems
We show that previous algorithmic and scheduling work concerning the use of lock-free objects in hard real-time systems can be extended to support real-time transactions on memory-resident data. Using our approach, transactions are not susceptible to priority inversion or deadlock, do not require complicated mechanisms for rolling back aborted transactions, and can be implemented as library rou...
متن کاملLock-Free Transactions for Real-Time Systems
We show that previous algorithmic and scheduling work concerning the use of lock-free objects in hard real-time systems can be extended to support real-time transactions on memory-resident data. Using our approach, transactions are not susceptible to priority inversion or deadlock, do not require complicated mechanisms for data-logging or for rolling back aborted transactions, and are implement...
متن کاملA framework for implementing objects and scheduling tasks in lock-free real-time systems
We present an integrated framework for developing realtime systems in which lock-free algorithms are employed to implement shared objects. There are two key objectives of our work. The first is to enable functionality for object sharing in lock-free real-time systems that is comparable to that in lock-based systems. Our main contribution toward this objective is an efficient approach for implem...
متن کاملTransparent Support for Wait-Free Transactions
This paper concerns software support for non-blocking transactions in shared-memory multiprocessors. We present mechanisms that convert sequential transactions into lock-free or wait-free ones. In contrast to some previous mechanisms, ours support transactions for which the set of memory locations accessed cannot be determined in advance. Our implementations automatically detect and resolve con...
متن کامل